Background
Related Work I begin with background information on ways for representing temporal networks and data structures for storing (static) networks. I then discuss work related to this thesis, including the use of hybrid data structures and other types of temporal network data structures. 2.1 Static Network Representations Static networks are typically represented in one of 3 ways [41]: • Adjacency matrix : A two-dimensional matrix, Auv, stores edge information for source node u to destination node v in the uvth element of the matrix. • Adjacency list: A set of lists, one for each source node u. Each list contains a series of destination nodes v, if edge (u, v) exists. • Adjacency dictionary: A hash table keyed by source nodes u mapped to the set of destination nodes v, if edge (u, v) exists. The adjacency matrix is the traditional data structure for network representation due to, in part, its simple construction, but also its prominence in key aspects of network analysis, such as spectral graph theory. The values stored in adjacency 7 matrices are typically boolean in nature, with a value of ”1” representing an edge is present between two nodes, and a value of ”0” otherwise. However, adjacency matrices can be modified to hold additional information by storing numeric values instead, e.g. edge weights. Since an adjacency matrix stores a value for both present and missing edges, it has a memory complexity of O(n 2 ), where n is the number of nodes, and is therefore only appropriate for smaller networks. The adjacency list representation aims to improve upon this memory complexity by removing the need to store missing edge information. By storing edges as a set of list, adjacency lists improve the memory complexity to O(k), where k is the number of edges. However, this approach suffers from increased time complexity during common operations such as finding if an edge exists between nodes u and v due to the unsorted nature of its lists. The adjacency dictionary representation is a variant on the standard adjacency list, by storing the edges in a hashed set rather than a list. Edges presence in an adjacency dictionary can be determined in O(1) time, matching the adjacency matrix, while retaining the O(k) space complexity of the adjacency list. By using a hash table instead of a hashed set, additional edge information can be stored inside the adjacency dictionary as well.
Statement of Problem
Th...
INTRODUCTION
Narration as a concept is the weaving of several strands of events into a story. This means narrative comes...
ABSTRACT
Generally, human beings relate and deal with animals in many instances. However, in the course of dealing or relating with anima...
ABSTRACT
The purpose of this study was to assess the influence of welfare on the performance of building site workers at...
EXCERPT FROM THE STUDY
Social Media is defined as the application that allows users to chat and interact with each other...
ABSTRACT: This study investigates strategies for enhancing vocational education for adult learners, focusing on addressing their unique needs...
Abstract
This research work assess the effect of bank charges on saving culture a case study of union bank Enugu...
CHAPTER ONE
INTRODUCTION
1.1
ABSTRACT: This research assessed the impact of early childhood education...
ABSTRACT: This study explores the benefits of early childhood education in fostering environmental activism among young children. Early childh...
ASSESSING THE IMPACT OF EARLY CHILDHOOD EDUCATION ON EMOTIONAL RESILIENCE
BENEFITS OF EARLY CHILDHOOD EDUCATION IN FOSTERING ENVIRONMENTAL ACTIVISM